Decidability by Filtrations for graded normal logics (graded modalities V)

نویسنده

  • Claudio Cerrato
چکیده

1. I n t r o d u c t i o n Graded normal logics ( G N L s ) are the extensions of modal normal logics to a language with graded modalities. The interpretation in usual Kripke models of a formula <>hA (n < w), whose main operator is a graded possibility, is there are more than n accessible worlds where A is true. When graded modalities were introduced (in [7], independently rediscovering a former idea of [8]), the purpose was to offer axiomatizations for the graded versions of the normal modal logics, and then to show completeness, compactness and decidability theorems for the fifteen main G N L s between K ° and $5 °. Completeness and compactness were fully proved in several steps ([8], [7], [5], [6], [2]), while the decidability had only partial answers in [7], [9], [1], [10], [11]. We prove decidability for all of the main G N L s by a suitable version of the notion of filtration, completing the basic investigation of graded modalities. Usually, when talking about filtrations one has in mind to start from a given model, then to obtain a quotient model with respect to a certain kind of set of formulas, and finally to suitably arrange the accessibility relation ([12], [13], [14], [3]). On the contrary, we reduce a model to a finite one by combining generated models with usual filtration techniques and with controls on the grades of modalities, respecting in a quite natural way the properties of the accessibility relation. Finally, as a corollary, since graded modalities really extend the usual ones, our notion of filtration can be used also for the usual normal modal logics (by restricting the attention to the formulas that contain as modal operators only n0 and <>0), avoiding the problems that usual filtrations offer to respect the properties of the accessibility relation ([3]). Presented by J an Zygmunt ; Received March 25, 1992; Revised February 10, 1993 Studia Logica 53: 61-73, 1994. © 1994 Kluwer Academic Publishers. Printed in the Netherlands.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Complexity of the Graded µ-Calculus

In classical logic, existential and universal quantifiers express that there exists at least one individual satisfying a formula, or that all individuals satisfy a formula. In many logics, these quantifiers have been generalized to express that, for a non-negative integer , at least individuals or all but individuals satisfy a formula. In modal logics, graded modalities generalize standard exis...

متن کامل

On the Semantics of Graded Modalities

We enrich propositional modal logic with operators ◇ (n ∈ N) which are interpreted on Kripke structures as “there are more than n accessible worlds for which ...”, thus obtaining a basic graded modal logic GrK. We show how some familiar concepts (such as subframes, p-morphisms, disjoint unions and filtrations) and techniques from modal model theory can be used to obtain results about expressive...

متن کامل

CTLModel-Checking with Graded Quantifiers

The use of the universal and existential quantifiers with the capability to express the concept of at least k or all but k, for a nonnegative integer k, has been thoroughly studied in various kinds of logics. In classical logic there are counting quantifiers, in modal logics graded modalities, in description logics number restrictions. Recently, the complexity issues related to the decidability...

متن کامل

Coalgebraic Hybrid Logic

We introduce a generic framework for hybrid logics, i.e. modal logics additionally featuring nominals and satisfaction operators, thus providing the necessary facilities for reasoning about individual states in a model. This framework, coalgebraic hybrid logic, works at the same level of generality as coalgebraic modal logic, and in particular subsumes, besides normal hybrid logics such as hybr...

متن کامل

An Infinitary Graded Modal Logic (Graded Modalities VI)

We prove a completeness theorem for K:l, the infinitary extension of the graded version K O of the minimal normal logic K , allowing conjunctions and disjunctions of countable sets of formulas. This goal is achieved using both the usual tools of the normal logics with graded modalities and the machinery of the predicate infinitary logics in a version adapted to modal logic. Mathematics Subject ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Studia Logica

دوره 53  شماره 

صفحات  -

تاریخ انتشار 1994